The Iterative Signature Algorithm 3 5 . 4 The Iterative Signature Algorithm
نویسندگان
چکیده
As we have seen in previous lectures, the technology of DNA chips allows the measurement of mRNA levels simultaneously for thousands of genes. The results of DNA chip experiments are usually organized together in a gene expression matrix, with rows corresponding to genes and columns corresponding to conditions. A bicluster can be defined as a submatrix spanned by a subset of genes and a subset of conditions in which the genes have joint behavior in the corresponding conditions. Different algorithmic approaches to the biclustering problem use different measures for the quality of a given biclustering solution. Hence, the definition of the goal function of each algorithm is part of its description. There are two important themes regarding biclustering algorithms:
منابع مشابه
A Novel Patch-Based Digital Signature
In this paper a new patch-based digital signature (DS) is proposed. The proposed approach similar to steganography methods hides the secure message in a host image. However, it uses a patch-based key to encode/decode the data like cryptography approaches. Both the host image and key patches are randomly initialized. The proposed approach consists of encoding and decoding algorithms. The encodin...
متن کاملConvergence theorems of multi-step iterative algorithm with errors for generalized asymptotically quasi-nonexpansive mappings in Banach spaces
The purpose of this paper is to study and give the necessary andsufficient condition of strong convergence of the multi-step iterative algorithmwith errors for a finite family of generalized asymptotically quasi-nonexpansivemappings to converge to common fixed points in Banach spaces. Our resultsextend and improve some recent results in the literature (see, e.g. [2, 3, 5, 6, 7, 8,11, 14, 19]).
متن کاملAn accelerated gradient based iterative algorithm for solving systems of coupled generalized Sylvester-transpose matrix equations
In this paper, an accelerated gradient based iterative algorithm for solving systems of coupled generalized Sylvester-transpose matrix equations is proposed. The convergence analysis of the algorithm is investigated. We show that the proposed algorithm converges to the exact solution for any initial value under certain assumptions. Finally, some numerical examples are given to demons...
متن کاملComparing IDREAM as an Iterative Reconstruction Algorithm against In Filtered Back Projection in Computed Tomography
Introduction: Recent studies of Computed Tomography (CT) conducted on patient dose reduction have recommended using an iterative reconstruction algorithm and mA (mili-Ampere) dose modulation. The current study aimed to evaluate Iterative Dose Reduction Algorithm (IDREAM) as an iterative reconstruction algorithm. Material and Methods: Two CT p...
متن کاملNetwork Planning Using Iterative Improvement Methods and Heuristic Techniques
The problem of minimum-cost expansion of power transmission network is formulated as a genetic algorithm with the cost of new lines and security constraints and Kirchhoff’s Law at each bus bar included. A genetic algorithm (GA) is a search or optimization algorithm based on the mechanics of natural selection and genetics. An applied example is presented. The results from a set of tests carried ...
متن کامل